Double sparse quantum state preparation
نویسندگان
چکیده
Initializing classical data in a quantum device is an essential step many algorithms. As consequence of measurement and noisy operations, some algorithms need to reinitialize the prepared state several times during its execution. In this work, we propose preparation algorithm called CVO-QRAM with computational cost O(kM), where M number nonzero probability amplitudes $k$ maximum bits value 1 patterns be stored. The proposed can alternative create sparse states future NISQ devices.
منابع مشابه
Nuclear state preparation via Landau-Zener-Stückelberg transitions in double quantum dots.
We theoretically model a nuclear-state preparation scheme that increases the coherence time of a two-spin qubit in a double quantum dot. The two-electron system is tuned repeatedly across a singlet-triplet level anticrossing with alternating slow and rapid sweeps of an external bias voltage. Using a Landau-Zener-Stückelberg model, we find that in addition to a small nuclear polarization that we...
متن کاملQuantum Gate and Quantum State Preparation through Neighboring Optimal Control
Title of dissertation: QUANTUM GATE AND QUANTUM STATE PREPARATION THROUGH NEIGHBORING OPTIMAL CONTROL Yuchen Peng, Doctor of Philosophy, 2016 Dissertation directed by: Dr. Frank Gaitan Laboratory for Physical Sciences Professor Victor Yakovenko Department of Physics Successful implementation of fault-tolerant quantum computation on a system of qubits places severe demands on the hardware used t...
متن کاملQuantum state preparation in circuit QED via Landau- Zener tunneling
– We study a qubit undergoing Landau-Zener transitions enabled by the coupling to a circuit-QED mode. Summing an infinite-order perturbation series, we determine the exact nonadiabatic transition probability for the qubit, being independent of the frequency of the QED mode. Possible applications are single-photon generation and the controllable creation of qubit-oscillator entanglement. Superco...
متن کاملEfficient state preparation for a register of quantum bits
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover’s quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of ...
متن کاملQuantum-state preparation and control via the Zeno effect
In recent times there has been increasing interest in the engineering of quantum states @1#. This interest has been prompted by the continual progress in the practical application of quantum theory, which usually demands the tailoring of specific states ~usually highly nonclassical! in order to develop the possibilities offered by the quantum framework ~for example, to encode and process quantu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2022
ISSN: ['1573-1332', '1570-0755']
DOI: https://doi.org/10.1007/s11128-022-03549-y